Global Rigidity of 2D Linearly Constrained Frameworks

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generic global rigidity of body-bar frameworks

A basic geometric question is to determine when a given framework G(p) is globally rigid in Euclidean space Rd, where G is a finite graph and p is a configuration of points corresponding to the vertices of G. G(p) is globally rigid in Rd if for any other configuration q for G such that the edge lengths of G(q) are the same as the corresponding edge lengths of G(p), then p is congruent to q. A f...

متن کامل

Operations Preserving Global Rigidity of Generic Direction-Length Frameworks

A two-dimensional direction-length framework is a pair (G, p), where G = (V ;D,L) is a graph whose edges are labeled as ‘direction’ or ‘length’ edges, and a map p from V to R. The label of an edge uv represents a direction or length constraint between p(u) and p(v). The framework (G, p) is called globally rigid if every other framework (G, q) in which the direction or length between the endvert...

متن کامل

Necessary Conditions for the Global Rigidity of Direction-Length Frameworks

It is an intriguing open problem to give a combinatorial characterisation or polynomial algorithm for determining when a graph is globally rigid in R. This means that any generic realisation is uniquely determined up to congruence when each edge represents a fixed length constraint. Hendrickson gave two natural necessary conditions, one involving connectivity and the other redundant rigidity. I...

متن کامل

An Algorithm for Global Minimization of Linearly Constrained Quadratic Functions

A branch and bound algorithm is proposed for finding an approximate global optimum of quadratic functions over a bounded polyhedral set. The algorithm uses Lagrangian duality to obtain lower bounds. Preliminary computational results are reported.

متن کامل

On Global Rigidity and Universal Rigidity of Generic Bar Frameworks with Few Vertices

Gale transform was successfully used to classify polytopes with few vertices; that is, r-dimensional polytopes with r + k vertices, where k is small. In this paper, we use Gale transform to classify r-dimensional generic bar frameworks with r + k vertices, where k ≤ 4; as universally rigid, globally rigid or nonglobally rigid.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Mathematics Research Notices

سال: 2020

ISSN: 1073-7928,1687-0247

DOI: 10.1093/imrn/rnaa157